Parametric reduction complexity of Volterra models using tensor decompositions
نویسندگان
چکیده
Discrete-time Volterra models play an important role in many application areas. The main drawback of these models is their parametric complexity due to the huge number of their parameters, the kernel coefficients. Using the symmetry property of the Volterra kernels, these ones can be viewed as symmetric tensors. In this paper, we apply tensor decompositions (PARAFAC and HOSVD) for reducing the kernel parametric complexity. Using the PARAFAC decomposition, we also show that Volterra models can be viewed as Wiener models in parallel. Simulation results illustrate the effectiveness of tensor decompositions for reducing the parametric complexity of cubic Volterra models.
منابع مشابه
Identification of Svd-parafac Based Third-order Volterra Models Using an Arls Algorithm
A broad class of nonlinear systems can be modeled by the Volterra series representation. However, the practical use of such a representation is often limited due to the large number of parameters associated with the Volterra filter structure. This paper is concerned with the problem of identification of third-order Volterra systems. The SVD technique is used to represent the quadratic Volterra ...
متن کاملTensor modeling and signal processing for wireless communication systems. (Modélisation et traitement tensoriel du signal pour les systèmes de communication sans-fil)
In several signal processing applications for wireless communications, the received signal is multidimensional in nature and may exhibit a multilinear algebraic structure. In this context, the PARAFAC tensor decomposition has been the subject of several works in the past six years. However, generalized tensor decompositions are necessary for covering a wider class of wireless communication syst...
متن کاملTensor Network alternating linear scheme for MIMO Volterra system identification
This article introduces two Tensor Train-based iterative algorithms for the identification of high order discrete-time nonlinear MIMO Volterra systems. The system identification problem is rewritten in terms of a Volterra tensor, which is never explicitly constructed, thus avoiding the curse of dimensionality. It is shown how each iteration of the two identification algorithms involves solving ...
متن کاملTensor Decompositions: A New Concept in Brain Data Analysis?
Matrix factorizations and their extensions to tensor factorizations and decompositions have become prominent techniques for linear and multilinear blind source separation (BSS), especially multiway Independent Component Analysis (ICA), Nonnegative Matrix and Tensor Factorization (NMF/NTF), Smooth Component Analysis (SmoCA) and Sparse Component Analysis (SCA). Moreover, tensor decompositions hav...
متن کاملNonlinear System Identification Based on Reduced Complexity Volterra Models
Conventional Volterra series model is hardly applied to engineering practice due to its parametric complexity and estimation difficulty. To solve this problem, nonlinear system identification using reduced complexity Volterra models is proposed. Since the nonlinear components often play a secondary role compared to the dominant, linear component of the system, they spend the most of identificat...
متن کامل